https://nova.newcastle.edu.au/vital/access/ /manager/Index ${session.getAttribute("locale")} 5 https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:30604 Wed 11 Apr 2018 10:30:31 AEST ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:21608 G = (V,E) is a bijection from the set of edges to the set of integers {1, 2,..., ∣E∣}. The weight of a vertex v is the sum of the labels of all the edges incident with v. If the vertex weights are all distinct then we say that the labeling is vertex-antimagic, or simply, antimagic. A graph that admits an antimagic labeling is called an antimagic graph. In this paper, we present a new general method of constructing families of graphs with antimagic labelings. In particular, our method allows us to prove that generalized web graphs and generalized flower graphs are antimagic.]]> Sat 24 Mar 2018 07:59:32 AEDT ]]>